#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=11;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL a[maxn];
LL n;
bool flag=false;
void dfs(LL pos,LL sum,bool f){
     if(flag){
        return;
     }
     if(pos==n+1){
        if(sum==0&&f==1){
            flag=true;
        }
        return;
     }
     dfs(pos+1,sum,f);
     dfs(pos+1,sum+a[pos],1);
     dfs(pos+1,sum-a[pos],1);

}
int main(void){
   	cin.tie(0);std::ios::sync_with_stdio(false);
    LL t;cin>>t;
    while(t--){
        cin>>n;
        flag=false;
        for(LL i=1;i<=n;i++) cin>>a[i];
        dfs(1,0,0);
        if(flag){
            cout<<"YES"<<"\n";
        }
        else{
            cout<<"NO"<<"\n";
        }
    }
   	return 0;
}
